ANALOGUE COMBINATORICS AND CELLULAR AUTOMATA—KEY ALGORITHMS AND LAY‐OUT DESIGN
Identifieur interne : 002846 ( Main/Exploration ); précédent : 002845; suivant : 002847ANALOGUE COMBINATORICS AND CELLULAR AUTOMATA—KEY ALGORITHMS AND LAY‐OUT DESIGN
Auteurs : Péter L. Venetianer [Hongrie] ; Péter Szolgay [Hongrie] ; Kenneth R. Crounse [États-Unis] ; Tamás Roska [Hongrie, États-Unis] ; Leon O. Chua [États-Unis]Source :
- International Journal of Circuit Theory and Applications [ 0098-9886 ] ; 1996-01.
Abstract
This paper demonstrates how certain logic and combinatorial tasks can be solved using CNNs. A design method is proposed for solving combinatorial tasks on a CNN. It can be used to simulate cellular automata on a CNN, to prove the self‐reproducing capability of the CNNUM and for sorting, histogram calculation, parity analysis and minimum Hamming distance computation. These solutions are especially useful since they can serve as subroutines of more complex CNNUM algorithms. As an important real‐life application the lay‐out of printed circuit boards is designed with the CNNUM at an extremely high speed.
Url:
DOI: 10.1002/(SICI)1097-007X(199601/02)24:1<145::AID-CTA910>3.0.CO;2-1
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000D11
- to stream Istex, to step Curation: 000C87
- to stream Istex, to step Checkpoint: 001C57
- to stream Main, to step Merge: 002990
- to stream Main, to step Curation: 002846
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">ANALOGUE COMBINATORICS AND CELLULAR AUTOMATA—KEY ALGORITHMS AND LAY‐OUT DESIGN</title><author><name sortKey="Venetianer, Peter L" sort="Venetianer, Peter L" uniqKey="Venetianer P" first="Péter L." last="Venetianer">Péter L. Venetianer</name></author><author><name sortKey="Szolgay, Peter" sort="Szolgay, Peter" uniqKey="Szolgay P" first="Péter" last="Szolgay">Péter Szolgay</name></author><author><name sortKey="Crounse, Kenneth R" sort="Crounse, Kenneth R" uniqKey="Crounse K" first="Kenneth R." last="Crounse">Kenneth R. Crounse</name></author><author><name sortKey="Roska, Tamas" sort="Roska, Tamas" uniqKey="Roska T" first="Tamás" last="Roska">Tamás Roska</name></author><author><name sortKey="Chua, Leon O" sort="Chua, Leon O" uniqKey="Chua L" first="Leon O." last="Chua">Leon O. Chua</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:8F46AC656A0478EB5470C2CA58FC079A08F17D8B</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1002/(SICI)1097-007X(199601/02)24:1<145::AID-CTA910>3.0.CO;2-1</idno><idno type="url">https://api.istex.fr/document/8F46AC656A0478EB5470C2CA58FC079A08F17D8B/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000D11</idno><idno type="wicri:Area/Istex/Curation">000C87</idno><idno type="wicri:Area/Istex/Checkpoint">001C57</idno><idno type="wicri:doubleKey">0098-9886:1996:Venetianer P:analogue:combinatorics:and</idno><idno type="wicri:Area/Main/Merge">002990</idno><idno type="wicri:Area/Main/Curation">002846</idno><idno type="wicri:Area/Main/Exploration">002846</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">ANALOGUE COMBINATORICS AND CELLULAR AUTOMATA—KEY ALGORITHMS AND LAY‐OUT DESIGN</title><author><name sortKey="Venetianer, Peter L" sort="Venetianer, Peter L" uniqKey="Venetianer P" first="Péter L." last="Venetianer">Péter L. Venetianer</name><affiliation wicri:level="1"><country xml:lang="fr">Hongrie</country><wicri:regionArea>Analogical and Neural Computing Laboratory, Hungarian Academy of Sciences, Pf. 63, H‐1518 Budapest</wicri:regionArea><wicri:noRegion>H‐1518 Budapest</wicri:noRegion></affiliation></author><author><name sortKey="Szolgay, Peter" sort="Szolgay, Peter" uniqKey="Szolgay P" first="Péter" last="Szolgay">Péter Szolgay</name><affiliation wicri:level="1"><country xml:lang="fr">Hongrie</country><wicri:regionArea>Analogical and Neural Computing Laboratory, Hungarian Academy of Sciences, Pf. 63, H‐1518 Budapest</wicri:regionArea><wicri:noRegion>H‐1518 Budapest</wicri:noRegion></affiliation></author><author><name sortKey="Crounse, Kenneth R" sort="Crounse, Kenneth R" uniqKey="Crounse K" first="Kenneth R." last="Crounse">Kenneth R. Crounse</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Electrical Engineering and Computer Sciences, and the Electronics Research Laboratory, University of California at Berkeley, Berkeley, CA 94720</wicri:regionArea><placeName><region type="state">Californie</region></placeName></affiliation></author><author><name sortKey="Roska, Tamas" sort="Roska, Tamas" uniqKey="Roska T" first="Tamás" last="Roska">Tamás Roska</name><affiliation wicri:level="1"><country xml:lang="fr">Hongrie</country><wicri:regionArea>Analogical and Neural Computing Laboratory, Hungarian Academy of Sciences, Pf. 63, H‐1518 Budapest</wicri:regionArea><wicri:noRegion>H‐1518 Budapest</wicri:noRegion></affiliation><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Electrical Engineering and Computer Sciences, and the Electronics Research Laboratory, University of California at Berkeley, Berkeley, CA 94720</wicri:regionArea><placeName><region type="state">Californie</region></placeName></affiliation></author><author><name sortKey="Chua, Leon O" sort="Chua, Leon O" uniqKey="Chua L" first="Leon O." last="Chua">Leon O. Chua</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Electrical Engineering and Computer Sciences, and the Electronics Research Laboratory, University of California at Berkeley, Berkeley, CA 94720</wicri:regionArea><placeName><region type="state">Californie</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="j">International Journal of Circuit Theory and Applications</title><title level="j" type="abbrev">Int. J. Circ. Theor. Appl.</title><idno type="ISSN">0098-9886</idno><idno type="eISSN">1097-007X</idno><imprint><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><pubPlace>London</pubPlace><date type="published" when="1996-01">1996-01</date><biblScope unit="volume">24</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="145">145</biblScope><biblScope unit="page" to="164">164</biblScope></imprint><idno type="ISSN">0098-9886</idno></series><idno type="istex">8F46AC656A0478EB5470C2CA58FC079A08F17D8B</idno><idno type="DOI">10.1002/(SICI)1097-007X(199601/02)24:1<145::AID-CTA910>3.0.CO;2-1</idno><idno type="ArticleID">CTA910</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0098-9886</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">This paper demonstrates how certain logic and combinatorial tasks can be solved using CNNs. A design method is proposed for solving combinatorial tasks on a CNN. It can be used to simulate cellular automata on a CNN, to prove the self‐reproducing capability of the CNNUM and for sorting, histogram calculation, parity analysis and minimum Hamming distance computation. These solutions are especially useful since they can serve as subroutines of more complex CNNUM algorithms. As an important real‐life application the lay‐out of printed circuit boards is designed with the CNNUM at an extremely high speed.</div></front></TEI><affiliations><list><country><li>Hongrie</li><li>États-Unis</li></country><region><li>Californie</li></region></list><tree><country name="Hongrie"><noRegion><name sortKey="Venetianer, Peter L" sort="Venetianer, Peter L" uniqKey="Venetianer P" first="Péter L." last="Venetianer">Péter L. Venetianer</name></noRegion><name sortKey="Roska, Tamas" sort="Roska, Tamas" uniqKey="Roska T" first="Tamás" last="Roska">Tamás Roska</name><name sortKey="Szolgay, Peter" sort="Szolgay, Peter" uniqKey="Szolgay P" first="Péter" last="Szolgay">Péter Szolgay</name></country><country name="États-Unis"><region name="Californie"><name sortKey="Crounse, Kenneth R" sort="Crounse, Kenneth R" uniqKey="Crounse K" first="Kenneth R." last="Crounse">Kenneth R. Crounse</name></region><name sortKey="Chua, Leon O" sort="Chua, Leon O" uniqKey="Chua L" first="Leon O." last="Chua">Leon O. Chua</name><name sortKey="Roska, Tamas" sort="Roska, Tamas" uniqKey="Roska T" first="Tamás" last="Roska">Tamás Roska</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002846 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002846 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:8F46AC656A0478EB5470C2CA58FC079A08F17D8B
|texte= ANALOGUE COMBINATORICS AND CELLULAR AUTOMATA—KEY ALGORITHMS AND LAY‐OUT DESIGN
}}
| This area was generated with Dilib version V0.6.32. |  |